R ESEARCH FIELDS OF DATA MINING ALGORITHMS Ferenc BODON

نویسنده

  • Lajos RÓNYAI
چکیده

Mining information and knowledge from large databases has been recognized by many researchers as a key research topic, and by many industrial companies as an important area with a possibility of obtaining more profit. Several information providing services, such as data warehousing and on-line services over the Internet, also noticed the need for various data mining techniques to better understand user behavior, to improve the service provided, and to increase the business opportunities. In this paper I give a short summary of the different data mining fields.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Surprising Results of Trie-based FIM Algorithms

Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related techniques can be applied in FIM algorithms to improve efficiency. In this paper we propose new techniques for fast management, but more importantly we scrutinize the well-known ones especially those which can be employed...

متن کامل

Proceedings of FIMI'03 Workshop on Frequent Itemset Mining Implementations

The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementation details. Most papers focus on the first factor, some describe the underlying data structures, but implementation details are almost always neglected. In this paper we show that the effect of implementation can be mor...

متن کامل

The Relation of Closed Itemset Mining, Complete Pruning Strategies and Item Ordering in Apriori-Based FIM Algorithms

In this paper we investigate the relationship between closed itemset mining, the complete pruning technique and item ordering in the Apriori algorithm. We claim, that when proper item order is used, complete pruning does not necessarily speed up Apriori, and in databases with certain characteristics, pruning increases run time significantly. We also show that if complete pruning is applied, the...

متن کامل

A fast APRIORI implementation

The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementation details. Most papers focus on the first factor, some describe the underlying data structures, but implementation details are almost always neglected. In this paper we show that the effect of implementation can be mor...

متن کامل

Data Mining in R using Rattle

T‎his paper is a brief introduction to the concepts, methods ‎and ‎algorithms ‎for ‎data ‎mining ‎in ‎statistical ‎software R ‎using a‎ ‎package ‎named ‎Rattle. Rattle ‎provides a‎ ‎good ‎graphical ‎environment ‎to ‎perform ‎some ‎of ‎the ‎procedures ‎and ‎algorithms ‎without ‎the ‎need ‎for ‎programming. ‎Some ‎parts ‎of ‎the ‎package ‎will ‎be ‎explained ‎by a‎ ‎number ‎of ‎examples.‎ ‎ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001